翻訳と辞書 Words near each other ・ Mining in Gabon ・ Mining in Georgia (country) ・ Mining in Hong Kong ・ Mining in India ・ Mining in Iran ・ Mining in Japan ・ Mining in Limburg ・ Mining in Mauritania ・ Minimum contacts ・ Minimum control speeds ・ Minimum crossing altitude ・ Minimum cut ・ Minimum daily balance ・ Minimum Data Set ・ Minimum degree algorithm ・ Minimum degree spanning tree ・ Minimum depth of occurrence ・ Minimum description length ・ Minimum design metal temperature ・ Minimum detectable signal ・ Minimum deviation ・ Minimum distance ・ Minimum distance estimation ・ Minimum efficiency reporting value ・ Minimum efficient scale ・ Minimum employer contribution ・ Minimum en route altitude ・ Minimum energy control ・ Minimum energy performance standard ・ Minimum Essential Emergency Communications Network Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Minimum degree spanning tree ： ウィキペディア英語版 Minimum degree spanning tree In graph theory, for a connected graph $G$, a spanning tree $T$ is a subgraph of $G$ with the least number of edges that still spans $G$. A number of properties can be proved about $T$. $T$ is acyclic, has ($|V|-1$) edges where $V$ is the number of vertices in $G$ etc. A minimum degree spanning tree $T\text{'}$ is a spanning tree which has the least maximum degree. The vertex of maximum degree in $T\text{'}$ is the least among all possible spanning trees of $G$. See Degree-Constrained Spanning Tree. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minimum degree spanning tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.